Diffusion on a tree with stochastically gated nodes

نویسندگان

  • Paul C Bressloff
  • Sean D Lawley
چکیده

We consider diffusion on a tree with nodes that randomly switch between allowing and prohibiting particles to pass. We find exact expressions for various splitting probabilities and mean first passage times for a single diffusing particle and show how the many parameters in the problem, such as the node gating statistics and tree topology, contribute to these exit statistics. We also consider a concentration of particles that can always pass through interior branch nodes and determine how an intermittent source at one end of the tree affects the flux at the other end. The latter problem is motivated by applications to insect respiration.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

درخت تجمیع داده براساس الگوریتم پویای شکل گیری رودخانه درشبکه حسگر بی سیم

One of the main challenges in Wireless Sensor Networks is the limited energy of nodes which can cause to reduce the lifetime of nodes and whole network respectively. Transmissions between the nodes consumes most of the nodes' energy so minimization of unnecessary transmissions can led to reduction of energy consumption. Therefor routing protocols designed based on optimal energy consumption are...

متن کامل

Stochastically gated local and occupation times of a Brownian particle.

We generalize the Feynman-Kac formula to analyze the local and occupation times of a Brownian particle moving in a stochastically gated one-dimensional domain. (i) The gated local time is defined as the amount of time spent by the particle in the neighborhood of a point in space where there is some target that only receives resources from (or detects) the particle when the gate is open; the tar...

متن کامل

An improved algorithm to reconstruct a binary tree from its inorder and postorder traversals

It is well-known that, given inorder traversal along with one of the preorder or postorder traversals of a binary tree, the tree can be determined uniquely. Several algorithms have been proposed to reconstruct a binary tree from its inorder and preorder traversals. There is one study to reconstruct a binary tree from its inorder and postorder traversals, and this algorithm takes running time of...

متن کامل

Diffusion influenced reactions at short times: Breakdown of the Debye–Smoluchowski description

Articles you may be interested in Short-time kinetics of an irreversible bimolecular solution reaction: Asymptotic prediction by a non-Markovian Smoluchowski approach Smoluchowski-type theory of stochastically gated diffusion-influenced reactions Geminate recombination in excitedstate protontransfer reactions: Numerical solution of the Debye–Smoluchowski equation with backreaction and compariso...

متن کامل

Power Reduction in Microprocessor Chips by Gated Clock Routing

This paper presents a zero-skew gated clock routing technique for VLSI circuits. The gated clock tree has masking gates at the internal nodes of the clock tree, which are selectively turned on and off by the gate control signals during the active and idle times of the circuit modules to reduce switched capacitance of the clock tree. The clock tree topology is constructed based on the locations ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016